On Ky Fan's minimax principle
نویسندگان
چکیده
منابع مشابه
Minimax Entropy Principle and Its Applicationto Texture
This article proposes a general theory and methodology, called the minimax entropy principle, for building statistical models for images (or signals) in a variety of applications. This principle consists of two parts. The rst is the maximum entropy principle for feature binding (or fusion): for a given set of observed feature statistics, a distribution can be built to bind these feature statist...
متن کاملCertainty Equivalence Principle and Minimax Team Problems
We consider a team problem, with two decision makers for simplicity, where the uncertainties are dealt with in a minimax fashion rather than in a stochastic framework. We do not assume that the players exchange information at any time. Thus new ideas are necessary to investigate that situation. In contrast with the classical literature we do not use necessary conditions, but investigate to what...
متن کاملMinimax Theorems on C1 Manifolds via Ekeland Variational Principle
Let X be a Banach space and Φ : X → R of class C1. We are interested in finding critical points for the restriction of Φ to the manifold M = {u ∈ X : G(u) = 1}, where G : X → R is a C1 function having 1 as a regular value. A point u ∈M is a critical point of the restriction of Φ to M if and only if dΦ(u)|TuM = 0 (see the definition in Section 2). Our purpose is to prove two general minimax prin...
متن کاملWeak and strong convergence of an inertial proximal method for solving Ky Fan minimax inequalities
In this paper we present the relaxed inertial proximal algorithm for Ky Fan minimax inequalities. Based on Opial lemma, we propose a weak convergence result to a solution of the problem by eliminating in the algorithm (RIPAFAN) the Browder–Halpern’s factor of contraction. We present after, a first result of strong convergence by adding a strong monotonicity condition. Secondly, we eliminate the...
متن کاملOn fans in multigraphs
We introduce a unifying framework for studying edge-colouring problems on multigraphs. This is defined in terms of a rooted directed multigraph F which is naturally associated to the set of fans based at a given vertex u in a multigraph G. We call F the “Fan Digraph”. We show that fans in G based at u are in one-to-one correspondence with directed trails in F starting at the root of F . We stat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Australian Mathematical Society
سال: 1978
ISSN: 1446-7887,1446-8107
DOI: 10.1017/s144678870001171x